Secure License Plate Matching using Homomorphic Encryption
نویسنده
چکیده
License plate matching plays an important role in applications like law enforcement and road pricing where the plate is first recognized and then compared to a database of authorized vehicle plates. If an entity with a license plate wants to find a match in the license plates database which is in the possession of another entity; matching in the encrypted domain ensures that the privacy of data of both the involved entities is preserved. This work explores the field of license plate matching in a secure way so that the sensitive information associated with it is protected. This thesis proposes a character recognition scheme which does not require any software, classifier or training data for identifying characters and yet yields a success rate of 98.5%. The recognized characters of the license plate is represented as an integer and the matching is performed on the encrypted integer values representing the number plates. Secure protocols using homomorphic encryption are designed for exact matching of the license plates. The matching procedure is error-free and the performance of matching for twenty one database sizes using two algorithms Paillier encryption and extended Gentry’s fully homomorphic system, are evaluated.
منابع مشابه
Secure Searching of Biomarkers Using Hybrid Homomorphic Encryption Scheme
As genome sequencing technology develops rapidly, there has lately been an increasing need to keep genomic data secure even when stored in the cloud and still used for research. In this paper, we are interested in designing a protocol for the secure outsourcing matching problem on encrypted data. We propose an efficient method to securely search a matching position with the query data and extra...
متن کامل5PM: Secure Pattern Matching
In this paper we consider the problem of secure pattern matching that allows singlecharacter wildcards and substring matching in the malicious (stand-alone) setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general and includes non-...
متن کاملHow to Combine Homomorphic Encryption and Garbled Circuits Improved Circuits and Computing the Minimum Distance Efficiently
We show how two existing paradigms for two-party secure function evaluation (SFE) in the semi-honest model can be combined securely and efficiently – those based on additively homomorphic encryption (HE) with those based on garbled circuits (GC) and vice versa. Additionally, we propose new GC constructions for addition, subtraction, multiplication, and comparison functions. Our circuits are app...
متن کاملIntroduction to Homomorphic Encryption
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...
متن کامل